Search results for "finite [mass]"

showing 10 items of 356 documents

ON A QUESTION OF BEIDLEMAN AND ROBINSON

2002

[EN] In [J. C. Beidleman, D. J. S. Robinson, J. Algebra 1997, 191, 686--703, Theorem A], Beidleman and Robinson proved that if a group satisfies the permutizer condition, it is soluble, its chief factors have order a prime number or 4 and G induces the full group of automorphisms in the chief factors of order 4. In this paper, we show that the converse of this theorem is false by showing some counterexamples. We also find some sufficient conditions for a group satisfying the converse of that theorem to satisfy the permutizer condition.

Pure mathematicsAlgebra and Number TheoryFinite soluble groupGroup (mathematics)Permutizer conditionPrime numberGrups Teoria deAutomorphismCombinatoricsConverseChief factorOrder (group theory)ÀlgebraAlgebra over a fieldMATEMATICA APLICADAMathematicsCounterexampleCommunications in Algebra
researchProduct

A C1-generic dichotomy for diffeomorphisms: Weak forms of hyperbolicity or infinitely many sinks or sources

2003

We show that, for every compact n-dimensional manifold, n > 1, there is a residual subset of Diff (M) of diffeomorphisms for which the homoclinic class of any periodic saddle of f verifies one of the following two possibilities: Either it is contained in the closure of an infinite set of sinks or sources (Newhouse phenomenon), or it presents some weak form of hyperbolicity called dominated splitting (this is a generalization of a bidimensional result of Mafine [Ma3]). In particular, we show that any Cl-robustly transitive diffeomorphism admits a dominated splitting.

Pure mathematicsClass (set theory)Infinite setMathematics::Dynamical SystemsGeneralizationMathematical analysisClosure (topology)ManifoldMathematics (miscellaneous)DiffeomorphismHomoclinic orbitStatistics Probability and UncertaintySaddleMathematicsAnnals of Mathematics
researchProduct

Iterative construction of Dupin cyclides characteristic circles using non-stationary Iterated Function Systems (IFS)

2012

International audience; A Dupin cyclide can be defined, in two different ways, as the envelope of an one-parameter family of oriented spheres. Each family of spheres can be seen as a conic in the space of spheres. In this paper, we propose an algorithm to compute a characteristic circle of a Dupin cyclide from a point and the tangent at this point in the space of spheres. Then, we propose iterative algorithms (in the space of spheres) to compute (in 3D space) some characteristic circles of a Dupin cyclide which blends two particular canal surfaces. As a singular point of a Dupin cyclide is a point at infinity in the space of spheres, we use the massic points defined by J.C. Fiorot. As we su…

Pure mathematicsEnvelope of spheresMathematical analysisDupin cyclideDupin cyclideTangent[ INFO.INFO-GR ] Computer Science [cs]/Graphics [cs.GR]Singular point of a curveComputer Graphics and Computer-Aided DesignIndustrial and Manufacturing Engineering[INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]Computer Science ApplicationsCircleIterated function systemDefinite symmetric bilinear formConic sectionSpace of spheresSubdivisionPoint (geometry)Mathematics::Differential GeometryPoint at infinityEnvelope (mathematics)Mathematics
researchProduct

A characterization of regular circular languages generated by marked splicing systems

2009

AbstractSplicing systems are generative devices of formal languages, introduced by Head in 1987 to model biological phenomena on linear and circular DNA molecules. A splicing system is defined by giving an initial set I and a set R of rules. Some unanswered questions are related to the computational power of circular splicing systems. In particular, a still open question is to find a characterization of circular languages generated by finite circular splicing systems (i.e., circular splicing systems with both I and R finite sets). In this paper we introduce a special class of the latter systems named marked systems. We prove that a marked system S generates a regular circular language if an…

Pure mathematicsGeneral Computer ScienceMolecular computing Splicing systems Circular words Formal languages Automata theoryMolecular computingQuantitative Biology::GenomicsDecidabilityTheoretical Computer ScienceSet (abstract data type)Formal languagesRegular languageFormal languageRNA splicingAutomata theorySplicing systemsCircular wordsFinite setAlgorithmWord (computer architecture)Automata theoryMathematicsComputer Science(all)
researchProduct

Multidimensional Borg–Levinson theorems for unbounded potentials

2018

We prove that the Dirichlet eigenvalues and Neumann boundary data of the corresponding eigenfunctions of the operator $-\Delta + q$, determine the potential $q$, when $q \in L^{n/2}(\Omega,\mathbb{R})$ and $n \geq 3$. We also consider the case of incomplete spectral data, in the sense that the above spectral data is unknown for some finite number of eigenvalues. In this case we prove that the potential $q$ is uniquely determined for $q \in L^p(\Omega,\mathbb{R})$ with $p=n/2$, for $n\geq4$ and $p>n/2$, for $n=3$.

Pure mathematicsGeneral MathematicsOperator (physics)010102 general mathematicsMathematics::Spectral TheoryEigenfunction01 natural sciencesOmega010101 applied mathematicsDirichlet eigenvalueBoundary data0101 mathematicsSpectral dataFinite setEigenvalues and eigenvectorsMathematicsAsymptotic Analysis
researchProduct

An Elementary Proof of a Theorem of Graham on Finite Semigroups

2020

The purpose of this note is to give a very elementary proof of a theorem of Graham that provides a structural description of finite 0-simple semigroups and its idempotent-generated subsemigroups.

Pure mathematicsGeneral Mathematicslcsh:Mathematics0-simple semigroupElementary proofMathematics::Rings and AlgebrasComputer Science (miscellaneous)finite semigroupRegular semigrouplcsh:QA1-939Engineering (miscellaneous)Mathematicsregular semigroupMathematics
researchProduct

The De Giorgi measure and an obstacle problem related to minimal surfaces in metric spaces

2010

Abstract We study the existence of a set with minimal perimeter that separates two disjoint sets in a metric measure space equipped with a doubling measure and supporting a Poincare inequality. A measure constructed by De Giorgi is used to state a relaxed problem, whose solution coincides with the solution to the original problem for measure theoretically thick sets. Moreover, we study properties of the De Giorgi measure on metric measure spaces and show that it is comparable to the Hausdorff measure of codimension one. We also explore the relationship between the De Giorgi measure and the variational capacity of order one. The theory of functions of bounded variation on metric spaces is us…

Pure mathematicsMathematics(all)General MathematicsApplied Mathematics010102 general mathematicsMathematical analysisBoxing inequalityCaccioppoli setDiscrete measureσ-finite measure01 natural sciencesRelaxed problemCapacitiesTransverse measure0103 physical sciencesComplex measureOuter measureHausdorff measure010307 mathematical physics0101 mathematicsBorel measureFunctions of bounded variationMathematicsJournal de Mathématiques Pures et Appliquées
researchProduct

Some basic theorems on the foundations of mathematics and their philosophical implications

1995

Research in the foundations of mathematics during the past few decades has produced some results, which seem to me of interest, not only in themselves, but also with regard to their implications for the traditional philosophical problems about the nature of mathematics. The results themselves, I believe, are fairly widely known, but nevertheless, I think, it will be useful to present them in outline once again, especially in view of the fact that, due to the work of various mathematicians, they have taken on a much more satisfactory form, than they had had originally. The greatest improvement was made possible through the precise definition of the concept of finite procedure, which plays a …

Pure mathematicsNoticeTuringcomputerFinite setFoundations of mathematicscomputer.programming_languageMathematicsEpistemology
researchProduct

The 0-Parameter Case

1998

As an introduction to the theory of bifurcations, in this chapter we want to consider individual vector fields, i.e., families of vector fields with a 0-dimensional parameter space. We will present two fundamentals tools: the desingularization and the asymptotic expansion of the return map along a limit periodic set. In the particular case of an individual vector field these techniques give the desired final result: the desingularization theorem says that any algebraically isolated singular point may be reduced to a finite number of elementary singularities by a finite sequence of blow-ups. If X is an analytic vector field on S 2, then the return map of any elementary graphic has an isolate…

Pure mathematicsPhase spaceVector fieldLimit (mathematics)Singular point of a curveFixed pointParameter spaceAsymptotic expansionFinite setMathematics
researchProduct

Uncountable existentially closed groups in locally finite group classes

1990

In this paper, will always denote a local class of locally finite groups, which is closed with respect to subgroups, homomorphic images, extensions, and with respect to cartesian powers of finite -groups. Examples for x are the classes L ℐπ of all locally finite π-groups and L(ℐπ ∩ ) of all locally soluble π-groups (where π is a fixed set of primes). In [4], a wreath product construction was used in the study of existentially closed -groups (=e.c. -groups); the restrictive type of construction available in [4] permitted results for only countable groups. This drawback was then removed partially in [5] with the help of permutational products. Nevertheless, the techniques essentially only per…

Pure mathematicsProfinite groupLocally finite groupGeneral MathematicsUncountable setClassification of finite simple groupsCA-groupExistentially closed modelMathematicsGlasgow Mathematical Journal
researchProduct